Chapter 5 Asynchronous P Systems
نویسندگان
چکیده
In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorter descriptions and achieve a performance comparable to the corresponding distributed algorithms.
منابع مشابه
Bit Error Performance for Asynchronous Ds Cdma Systems Over Multipath Rayleigh Fading Channels (RESEARCH NOTE)
In recent years, there has been considerable interest in the use of CDMA in mobile communications. Bit error rate is one of the most important parameters in the evaluation of CDMA systems. In this paper, we develop a technique to find an accurate approximation to the probability of bit error for asynchronous direct–sequence code division multiple–access (DS/CDMA) systems by modeling the multipl...
متن کاملAsynchronous Memory Controller with Data Validation A THESIS SUBMITTED FOR THE DEGREE OF MEng ELECTRONICS ENGINEERING
........................................................................................................................... i ACKNOWLEDGEMENTS ................................................................................................... ii CONTENTS ......................................................................................................................... iii CHAPTER 1 – INTR...
متن کاملDecentralized and Cooperative Multi-Sensor Multi-Target Tracking With Asynchronous Bearing Measurements
Bearings only tracking is a challenging issue with many applications in military and commercial areas. In distributed multi-sensor multi-target bearings only tracking, sensors are far from each other, but are exchanging data using telecommunication equipment. In addition to the general benefits of distributed systems, this tracking system has another important advantage: if the sensors are suff...
متن کاملAsynchronous Multi-Objective Optimisation in Unreliable Distributed Environments
This chapter examines the performance characteristics of both asynchronous and synchronous parallel particle swarm optimisation algorithms in heterogeneous, fault-prone environments. The chapter starts with a simple parallelisation paradigm, the Master-Slave model using Multi-Objective Particle Swarm Optimisation (MOPSO) in a heterogeneous environment. Extending the investigation to general, di...
متن کاملConsensus in Asynchronous Distributed Systems: A Concise Guided Tour
It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is on the Consensus problem. It studies Consensus in two failure models, namely, the Crash/no Recovery model and the Crash/Recovery model. The assumptions related to the detection of failures that are required to solve Consensus in...
متن کامل